Run-time Behavior of Contour Tracing Algorithms for Document Conversion
نویسندگان
چکیده
low cost and reliable system. In this paper, we present the run-time behavior of contour tracing algorithms for processing large documents, in a contemporary workstation environment. The performance criteria examined are processing time, memory usage, and the number of page faults. A new contour tracing algorithm based on Capson's algorithm is proposed and it is compared with other algorithms. It is observed that for the set of document images under test, the new algorithm consumes the least amount of memory, has the smallest number of page faults and is slightly faster than Capson's algorithm.
منابع مشابه
A New Data Compression Technique for Event Based Program Traces
The paper presents an innovative solution to the problem of the very huge data sets that are regularly produced by performance tracing techniques especially on HPC programs. It designs an adapted data compression scheme that takes advantage of regularities frequently found in program traces. Algorithms to reveal repetition patterns in a programs call structure and run time behavior are discusse...
متن کاملA Component-Labeling Algorithm Using Contour Tracing Technique
A new method for finding connected components from binary images is presented in this article. The main step of this method is to use a contour tracing technique to detect component contours and also to fill in interior areas. All the component points are traced by this algorithm in a single pass and are assigned either a new label or the same label as their neighboring pixels. Experimenting on...
متن کاملEvaluation of Stopping Criterion in Contour Tracing Algorithms
Under the conditions of fasting moving, shape changing and partial occlusion of target, Now mostly tracing algorithms are difficult to get accurate contour of target, for these problems, a novel contour tracing algorithm based on particle filter and fast level set is proposed. Firstly, the particle filter algorithm is adopted to estimate moving target's boundary contour. Then, according to the ...
متن کاملRaster to Vector Conversion in a Map Interpretation System
This paper describes the two components: thinning and vectorization, at the front end of a Geographic Information System. The raster dataset associated with a map is very large. A small D-sized drawing gives a 120 Mpixel document. The amount of page faults encountered by a typical conventional thinning algorithm is so large that the run time is dominated by disk 110 time. The Contour Generation...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996